skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Reid, Tim"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. This paper presents a probabilistic perspective on iterative methods for approximating the solution x in R^d of a nonsingular linear system Ax = b. Classically, an iterative method produces a sequence x_m of approximations that converge to x in R^d. Our approach, instead, lifts a standard iterative method to act on the set of probability distributions, P(Rd), outputting a sequence of probability distributions  mu_m in P(Rd). The output of a probabilistic iterative method can provide both a “best guess” for x, for example by taking the mean of  mu_m, and also probabilistic uncertainty quantification for the value of x when it has not been exactly determined. A comprehensive theoretical treatment is presented in the case of a stationary linear iterative method, where we characterise both the rate of contraction of  mu_m to an atomic measure on x and the nature of the uncertainty quantification being provided. We conclude with an empirical illustration that highlights the potential for probabilistic iterative methods to provide insight into solution uncertainty. 
    more » « less
  2. This paper presents a probabilistic perspective on iterative methods for approximating the solution x in R^d of a nonsingular linear system Ax = b. Classically, an iterative method produces a sequence x_m of approximations that converge to x in R^d. Our approach, instead, lifts a standard iterative method to act on the set of probability distributions, P(Rd), outputting a sequence of probability distributions  mu_m in P(Rd). The output of a probabilistic iterative method can provide both a “best guess” for x, for example by taking the mean of mu_m, and also probabilistic uncertainty quantification for the value of x when it has not been exactly determined. A comprehensive theoretical treatment is presented in the case of a stationary linear iterative method, where we characterise both the rate of contraction of  mu_m to an atomic measure on x and the nature of the uncertainty quantification being provided. We conclude with an empirical illustration that highlights the potential for probabilistic iterative methods to provide insight into solution uncertainty. 
    more » « less